A Generalization of the Kummer Identity and Its Application to Fibonacci-lucas Sequences

نویسندگان

  • Xinrong Ma
  • Albert Girard
چکیده

They found that transformation of (1) or (2) is related to Fibonacci numbers. Recently, Shapiro et al. [8] and Sprugnoli [10] introduced the theories of the Riordan array and the Riordan group, respectively, in an effort to answer the following question: What are the conditions under which a combinatorial sum can be evaluated by transforming the generating function? We think that the works of Gould and Haukkanen mentioned above can be extended by using the Riordan group or the Riordan array. We adopt the concept of the Riordan group in this paper because both theories are essentially the same. It is certain that the idea of the Riordan group can be traced back to Mullin and Rota [5], Rota [6], and Roman and Rota [7]. The reader is referred to [5][10] for more details. In the present paper we are concerned with the following identity, called the Kumrner identity:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Identities for Generalized Fibonacci and Lucas Sequences

In this study, we define a generalization of Lucas sequence {pn}. Then we obtain Binet formula of sequence {pn} . Also, we investigate relationships between generalized Fibonacci and Lucas sequences.

متن کامل

On the Properties of Balancing and Lucas-Balancing $p$-Numbers

The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing $p$-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.

متن کامل

The (non-)existence of perfect codes in Lucas cubes

A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...

متن کامل

A New Generalization of Jacobsthal Numbers (bi-periodic Jacobsthal Sequences)

The bi-periodic Fibonacci sequence also known as the generalized Fibonacci sequence was fırst introduced into literature in 2009 by Edson and Yayenie [9] after which the bi-periodic Lucas sequence was defined in a similar fashion in 2004 by Bilgici [5]. In this study, we introduce a new generalization of the Jacobsthal numbers which we shall call bi-periodic Jacobsthal sequences similar to the ...

متن کامل

Toeplitz transforms of Fibonacci sequences

We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010